Recoverability Bounds for Parallel Compressive Sensing MRI
نویسنده
چکیده
σ using both SENSE and the hybrid CS+SENSE methods. Note that the clear optimality peak in the CS result. (c) Plot of the upper bound derived in (5) showing that the probability that μ(E) exceeds some threshold is minimal at roughly the same configuration yielding optimal SNR in (b). (d) Monte Carlo simulation of μ(E) for 1000 random Fourier trials at each value of σ. Note that the coil configuration yielding minimal μ(E) corresponds with the minimum of the bound in (c) and again the optimality peak in (b). Recoverability Bounds for Parallel Compressive Sensing MRI
منابع مشابه
Compressed Sensing Recoverability In Imaging Modalities
The paper introduces a framework for the recoverability analysis in compressive sensing for imaging applications such as CI cameras, rapid MRI and coded apertures. This is done using the fact that the Spherical Section Property (SSP) of a sensing matrix provides a lower bound for unique sparse recovery condition. The lower bound is evaluated for different sampling paradigms adopted from the afo...
متن کاملAnalysis of Sparse MIMO Radar
We consider a multiple-input-multiple-output radar system and derive a theoretical framework for the recoverability of targets in the azimuth-range domain and the azimuth-range-Doppler domain via sparse approximation algorithms. Using tools developed in the area of compressive sensing, we prove bounds on the number of detectable targets and the achievable resolution in the presence of additive ...
متن کاملTheory of Compressive Sensing via 1-Minimization: a Non-RIP Analysis and Extensions
Compressive sensing (CS) is an emerging methodology in computational signal processing that has recently attracted intensive research activities. At present, the basic CS theory includes recoverability and stability: the former quantifies the central fact that a sparse signal of length n can be exactly recovered from far fewer than n measurements via 1-minimization or other recovery techniques,...
متن کاملOn Theory of Compressive Sensing via `1-Minimization: Simple Derivations and Extensions
Compressive (or compressed) sensing (CS) is an emerging methodology in computational signal processing that has recently attracted intensive research activities. At present, the basic CS theory includes recoverability and stability: the former quantifies the central fact that a sparse signal of length n can be exactly recovered from far fewer than n measurements via `1minimization or other reco...
متن کاملRecoverability Analysis for Modified Compressive Sensing with Partially Known Support
The recently proposed modified-compressive sensing (modified-CS), which utilizes the partially known support as prior knowledge, significantly improves the performance of recovering sparse signals. However, modified-CS depends heavily on the reliability of the known support. An important problem, which must be studied further, is the recoverability of modified-CS when the known support contains...
متن کامل